Model theory and topoi
نویسندگان
چکیده
منابع مشابه
Complete Topoi Representing Models of Set Theory
Blass, A. and A. Scedrov, Complete topoi representing models of set theory, Annals of Pure and Applied Logic 57 (1992) l-26. By a model of set theory we mean a Boolean-valued model of Zermelo-Fraenkel set theory allowing atoms (ZFA), which contains a copy of the ordinary universe of (two-valued, pure) sets as a transitive subclass; examples include Scott-Solovay Boolean-valued models and their ...
متن کاملTannaka Theory over Sup-lattices and Descent for Topoi
We consider locales B as algebras in the tensor category s` of sup-lattices. We show the equivalence between the Joyal-Tierney descent theorem for open localic surjections shB q −→ E in Galois theory and a Tannakian recognition theorem over s` for the s`-functor Rel(E) Rel(q ∗) −→ Rel(shB) ∼= (B-Mod)0 into the s`-category of discrete B-modules. Thus, a new Tannaka recognition theorem is obtaine...
متن کاملOn the Representation Theory of Galois and Atomic Topoi
The notion of a (pointed) Galois pretopos (“catégorie galoisienne”) was considered originally by Grothendieck in [12] in connection with the fundamental group of an scheme. In that paper Galois theory is conceived as the axiomatic characterization of the classifying pretopos of a profinite group G. The fundamental theorem takes the form of a representation theorem for Galois pretopos (see [10] ...
متن کاملSheaf representation for topoi
It is shown that every (small) topos is equivalent to the category of global sections of a sheaf of so-called hyperlocal topoi, improving on a result of Lambek & Moerdijk. It follows that every boolean topos is equivalent to the global sections of a sheaf of well-pointed topoi. Completeness theorems for higher-order logic result as corollaries. The main result of this paper is the following. Th...
متن کاملNumerology in Topoi
This paper studies numerals (see definition that immediately follows), natural numbers objects and, more generally, free actions, in a topos. A pre-numeral is a poset with a constant, 0, and a unary operation, s, such that: PN1) x ≤ y ⇒ sx ≤ sy PN2) x ≤ sx A numeral is a “minimal” pre-numeral, that is, one such that any s-invariant subobject containing 0 is entire. 1. Lemma. A pre-numeral is a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1976
ISSN: 0001-8708
DOI: 10.1016/0001-8708(76)90156-0